Automatic Functional Correctness Proofs for Functional Search Trees
نویسنده
چکیده
In a new approach, functional correctness specifications of insert/update and delete operations on search trees are expressed on the level of lists by means of an inorder traversal function that projects trees to lists. With the help of a small lemma library, functional correctness and preservation of the search tree property are proved automatically (in Isabelle/HOL) for a range of data structures: unbalanced binary trees, AVL trees, red-black trees, 2-3 and 2-3-4 trees, 1-2 brother trees, AA trees and splay trees.
منابع مشابه
Verified Analysis of Functional Data Structures
In recent work the author has analyzed a number of classical functional search tree and priority queue implementations with the help of the theorem prover Isabelle/HOL. The functional correctness proofs of AVL trees, red-black trees, 2-3 trees, 2-3-4 trees, 1-2 brother trees, AA trees and splay trees could be automated. The amortized logarithmic complexity of skew heaps, splay trees, splay heap...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملBenl, Berger, Schwichtenberg, Seisenberger, Zuber Proof Theory at Work: Program Development in the Minlog System
The old idea that proofs are in some sense functions, has been made precise by the Curry-Howard-correspondence between proofs in natural deduction and terms in typed λ-calculus. Since the latter can be viewed as an idealized functional programming language, this amounts to an interpretation of proofs as functional programs. This concept and related ones going back to work of Gentzen, Gödel, Kle...
متن کاملBenl, Berger, Schwichtenberg, Seisenberger, Zuber Proof Theory at Work: Program Development in the Minlog System
The old idea that proofs are in some sense functions, has been made precise by the Curry-Howard-correspondence between proofs in natural deduction and terms in typed λ-calculus. Since the latter can be viewed as an idealized functional programming language, this amounts to an interpretation of proofs as functional programs. This concept and related ones going back to work of Gentzen, Gödel, Kle...
متن کاملSplay Tree
Splay trees are self-adjusting binary search trees which were invented by Sleator and Tarjan [1]. This entry provides executable and verified functional splay trees. The amortized complexity of splay trees is analyzed in the AFP entry Amortized Complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016